On domination and independent domination numbers of a graph
نویسندگان
چکیده
منابع مشابه
On trees with equal Roman domination and outer-independent Roman domination numbers
A Roman dominating function (RDF) on a graph $G$ is a function $f : V (G) to {0, 1, 2}$satisfying the condition that every vertex $u$ for which $f(u) = 0$ is adjacent to at least onevertex $v$ for which $f(v) = 2$. A Roman dominating function $f$ is called an outer-independentRoman dominating function (OIRDF) on $G$ if the set ${vin Vmid f(v)=0}$ is independent.The (outer-independent) Roman dom...
متن کاملComplexity of Comparing the Domination Number to the Independent Domination, Connected Domination, and Paired Domination Numbers
The domination number γ(G), the independent domination number ι(G), the connected domination number γc(G), and the paired domination number γp(G) of a graph G (without isolated vertices, if necessary) are related by the simple inequalities γ(G) ≤ ι(G), γ(G) ≤ γc(G), and γ(G) ≤ γp(G). Very little is known about the graphs that satisfy one of these inequalities with equality. I.E. Zverovich and V...
متن کاملOn certain graph domination numbers and applications
In this paper we compute for paths and cycles certain graph domination invariants like locating domination number, differentiating domination number, global alliance number etc., We also do some comparison analysis of certain parameters defined by combining the domination measures and the second smallest eigen value of the Laplacian matrix of all connected graphs of order 4.While discussing app...
متن کاملOn domination numbers of graph bundles
Let γ(G) be the domination number of a graph G. It is shown that for any k ≥ 0 there exists a Cartesian graph bundle B φF such that γ(B φF ) = γ(B)γ(F )−2k. The domination numbers of Cartesian bundles of two cycles are determined exactly when the fibre graph is a triangle or a square. A statement similar to Vizing’s conjecture on strong graph bundles is shown not to be true by proving the inequ...
متن کاملOn the edge geodetic and edge geodetic domination numbers of a graph
In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1978
ISSN: 0012-365X
DOI: 10.1016/0012-365x(78)90105-x